An Interior Point Sequential Approximate Optimization Methodology
نویسندگان
چکیده
The use of optimization in a simulation based design environment has become a common trend in industry today. Computer simulation tools are common place in many engineering disciplines, providing the designers with tools to evaluate a design’s performance without building a physical prototype. This has triggered the development of optimization techniques suitable for dealing with such simulations. One of these approaches is known as sequential approximate optimization. In sequential approximate minimization a sequence of optimizations are performed over local response surface approximations of the system. This paper details the development of an interior point approach for trust region managed sequential approximate optimization. The interior point approach will insure that approximate feasibility is maintained throughout the optimization process. This facilitates the delivery of a usable design at each iteration when subject to reduced design cycle time constraints. In order to deal with infeasible starting points, homotopy methods are used to relax constraints and push designs toward feasibility. Results of application studies are presented, illustrating the applicability of the proposed algorithm.
منابع مشابه
Homotopy Curve Tracking in Approximate Interior Point Optimization
The use of computer simulations has revolutionized the way engineers design and improve products and affects all design stages from concept to realization. As a consequence optimization has become an important tool for the engineer to realize better designs without the need of extensive prototype building. One of the algorithms that has shown an important ability to deal with this type of optim...
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملA New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibili...
متن کاملApplication of an Interior Point Sequential Approximate Optimization Method to an Autonomous Underwater Vehicle
Simulation based design has become a major tool in the design of automotive, aerospace and consumer products. Designers are faced with the continuous challenge of reducing manufacturing costs and design cycle times while improving the systems performance and reliability. Simulation based design plays an increasingly prominent role in facilitating the conceptualization and realization of product...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کامل